Matching With Minimal Priority Rights

نویسنده

  • Szilvia Pápai
چکیده

I study two prominent strategyproof matching rules when strict priorities over objects are given exogenously: the Deferred Acceptance Rule (DA) and the Top Trading Cycle Rule With Inheritance (TTC). It is well known that the DA rule is stable while the TTC rule is efficient, but not vice versa, and that these two properties cannot be reconciled. The primary innovation of the paper is the introduction of a new weaker concept of stability, Individual Trade Stability, which allows for trading the priorities for objects, a property that is satisfied by both the DA and TTC rules, as well as by all the hybrid rules of these two matching rules that I propose, called Deferred Trading Cycle Rules. The main result is a characterization of the class of Deferred Trading Cycle Rules by Individual Trade Stability, Constrained Efficiency, and an invariance property called Lower Invariance. The characterized class of matching rules include the DA and TTC rules as the two extreme rules in the class. ∗Department of Economics, Concordia University and CIREQ, 1455 de Maisonneuve Blvd. West, Montreal, Quebec H3G 1M8, Canada; e-mail: [email protected] †I would like to thank Justin Leroux, Jim Schummer, Utku Ünver, and Licun Xue for comments and discussions. Financial support from the Canada Research Chair fund is greatly appreciated.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fan-KKM Theorem in Minimal Vector Spaces and its Applications

In this paper, after reviewing some results in minimal space, some new results in this setting are given. We prove a generalized form of the Fan-KKM typetheorem in minimal vector spaces. As some applications, the open type of matching theorem and generalized form of the classical KKM theorem in minimal vector spaces are given.

متن کامل

On the computational complexity of finding a minimal basis for the guess and determine attack

Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...

متن کامل

Minimal rights based solidarity

In a model where individuals with different levels of skills exert different levels of effort, we propose to use individuals’ minimal rights to divide an extra amount of income generated by a change in the skill profile. Priority is given to individuals with a positive minimal right which ensures that the way redistribution is performed depends on the total sum of income available in society. W...

متن کامل

Cohen-Macaulay $r$-partite graphs with minimal clique cover

‎In this paper‎, ‎we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay‎. ‎It is proved that if there exists a cover of an $r$-partite Cohen-Macaulay graph by disjoint cliques of size $r$‎, ‎then such a cover is unique‎.

متن کامل

Faster Maximium Priority Matchings in Bipartite Graphs

A maximum priority matching is a matching in an undirected graph that maximizes a priority score defined with respect to given vertex priorities. An earlier paper showed how to find maximum priority matchings in unweighted graphs. This paper describes an algorithm for bipartite graphs that is faster when the number of distinct priority classes is limited. For graphs with k distinct priority cla...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013